On Considering Constraints of Different Importance in Fuzzy Constraint Satisfaction Problems

نویسنده

  • Vicenç Torra
چکیده

Several real-world applications (e.g., scheduling, configuration, ... ) can be formulated as Constraint Satisfaction Problems (CSP). In these cases, a set of variables have to be settled to a value with the requirement that they satisfy a set of constraints. Classical CSPs are defined only by means of crisp (Boolean) constraints. However, as sometimes Boolean constraints are too strict in relation to human reasoning, fuzzy constraints were introduced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Method for Solving Constraint Satisfaction Problems

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...

متن کامل

A New Method for Solving Constraint Satisfaction Problems

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...

متن کامل

n Solving Fuzzy Constraint Satisfaction Problems with Genetic Algorithms

An attempt to solve fuzzy constraint satisfaction problems (FCSPs) with the use of genetic algorithms (GAS) is presented in the paper. A fuzzy relation that represents the degrees of Satisfaction of fuzzy constraints in a given FCSP is considered as an objective jimction of the respective unconstrained optimization problem. A solution of a FCSP such that all constraints are satisfied to the max...

متن کامل

Profit maximization solid transportation problem under budget constraint using fuzzy measures

Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...

متن کامل

Fuzzy rrDFCSP and planning

Constraint satisfaction is a fundamental Artificial Intelligence technique for knowledge representation and inference. However, the formulation of a static constraint satisfaction problem (CSP) with hard, imperative constraints is insufficient to model many real problems. Fuzzy constraint satisfaction provides a more graded viewpoint. Priorities and preferences are placed on individual constrai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1998